An Alternative TAGE-like Conditional Branch Predictor
نویسندگان
چکیده
منابع مشابه
A 64 Kbytes ISL - TAGE branch predictor ∗
The ISL-TAGE predictor consists in a TAGE predictor combined with a loop predictor (to predict loops) , a Statistical Corrector predictor and an Immediate Update Mimicker, IUM. A TAGE predictor [4] constitutes the core of the ISL-TAGE predictor. The TAGE predictor (Section 2) captures most of the correlation on the branch outcomes for very long histories. But sometimes TAGE fails to predict loo...
متن کاملTAGE-SC-L Branch Predictors∗
The TAGE predictor [12] is considered as one of the most storage effective global branch/path history predictors. It has been shown that associated with small adjunct predictors like a statistical corrector (SC for short) and/or a loop predictor (L for short) [11, 10], TAGE can even be more effective. In this study, we explore the performance limits of these TAGE-SC-L predictors for respectivel...
متن کاملAn optimized 2bcgskew branch predictor
The hybrid skewed predictor 2bcgskew (Figure 1) was proposed in [4]. The Alpha EV8 branch predictor [3] was derived from this proposal. The original hybrid predictor 2bcgskew combines an e-gskew predictor [2] and a bimodal predictor. 2bcgskew consists of four 2-bit counters banks. Bank BIM is the bimodal predictor, but is also part of the e-gskew predictor. Banks G0 and G1 are two gshare-like p...
متن کاملAn Efficient Indirect Branch Predictor
In this paper, we present a new hybrid branch predictor called the GoStay2, which can effectively reduce indirect misprediction rates. The GoStay2 has two different mechanisms compared to other 2-stage hybrid predictors that use a Branch Target Buffer (BTB) as the first stage predictor: Firstly, to reduce conflict misses in the first stage, a new effective 2-way cache scheme is used instead of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Architecture and Code Optimization
سال: 2018
ISSN: 1544-3566,1544-3973
DOI: 10.1145/3226098